Solving Regularized Least Squares with Qualitatively Controlled Adaptive Cross-Approximated Matrices
نویسندگان
چکیده
منابع مشابه
Regularized Least-Squares Classification
We consider the solution of binary classification problems via Tikhonov regularization in a Reproducing Kernel Hilbert Space using the square loss, and denote the resulting algorithm Regularized Least-Squares Classification (RLSC). We sketch the historical developments that led to this algorithm, and demonstrate empirically that its performance is equivalent to that of the well-known Support Ve...
متن کاملRegularized Least Squares
{(xi, yi)}i=1 are the given data points, V (·) represents the loss function indicating the penalty we pay for predicting f(xi) when the true value is yi, and ‖f‖H is a Hilbert space norm regularization term with a regularization parameter λ which controls the stability of the solution and trades-off regression accuracy for a function with small norm in RKHS H. Denote by S the training set {(x1,...
متن کاملSolving Regularized Total Least Squares Problems Based on Eigenproblems
The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems regularization is necessary to stabilize the computed solution. In this paper we summarize two iterative methods which are based on a sequence of eigenproblems. The focus is on efficient implementation with...
متن کاملA Fast Algorithm for Solving Regularized Total Least Squares Problems
The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457 476] suggested an iterative method which is based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we ac...
متن کاملEfficient AUC Maximization with Regularized Least-Squares
Area under the receiver operating characteristics curve (AUC) is a popular measure for evaluating the quality of binary classifiers, and intuitively, machine learning algorithms that maximize an approximation of AUC should have a good AUC performance when classifying new examples. However, designing such algorithms in the framework of kernel methods has proven to be challenging. In this paper, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Fundamentals and Materials
سال: 2005
ISSN: 0385-4205,1347-5533
DOI: 10.1541/ieejfms.125.419